The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(2^n, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

rev(nil) → nil
rev(cons(x, l)) → cons(rev1(x, l), rev2(x, l))
rev1(0, nil) → 0
rev1(s(x), nil) → s(x)
rev1(x, cons(y, l)) → rev1(y, l)
rev2(x, nil) → nil
rev2(x, cons(y, l)) → rev(cons(x, rev2(y, l)))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(2ⁿ):
The rewrite sequence
rev2(x, cons(y, l)) →⁺ cons(rev1(x, rev2(y, l)), rev2(x, rev2(y, l)))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0,1].
The pumping substitution is [l / cons(y, l)].
The result substitution is [x / y].

The rewrite sequence
rev2(x, cons(y, l)) →⁺ cons(rev1(x, rev2(y, l)), rev2(x, rev2(y, l)))
gives rise to a decreasing loop by considering the right hand sides subterm at position [1,1].
The pumping substitution is [l / cons(y, l)].
The result substitution is [x / y].

(2) BOUNDS(2^n, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

rev(nil) → nil
rev(cons(x, l)) → cons(rev1(x, l), rev2(x, l))
rev1(0', nil) → 0'
rev1(s(x), nil) → s(x)
rev1(x, cons(y, l)) → rev1(y, l)
rev2(x, nil) → nil
rev2(x, cons(y, l)) → rev(cons(x, rev2(y, l)))

S is empty.
Rewrite Strategy: FULL

(5) SlicingProof (LOWER BOUND(ID) transformation)

Sliced the following arguments:
s/0

(6) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

rev(nil) → nil
rev(cons(x, l)) → cons(rev1(x, l), rev2(x, l))
rev1(0', nil) → 0'
rev1(s, nil) → s
rev1(x, cons(y, l)) → rev1(y, l)
rev2(x, nil) → nil
rev2(x, cons(y, l)) → rev(cons(x, rev2(y, l)))

S is empty.
Rewrite Strategy: FULL

(7) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(8) Obligation:

TRS:
Rules:
rev(nil) → nil
rev(cons(x, l)) → cons(rev1(x, l), rev2(x, l))
rev1(0', nil) → 0'
rev1(s, nil) → s
rev1(x, cons(y, l)) → rev1(y, l)
rev2(x, nil) → nil
rev2(x, cons(y, l)) → rev(cons(x, rev2(y, l)))

Types:
rev :: nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
rev1 :: 0':s → nil:cons → 0':s
rev2 :: 0':s → nil:cons → nil:cons
0' :: 0':s
s :: 0':s
hole_nil:cons1_0 :: nil:cons
hole_0':s2_0 :: 0':s
gen_nil:cons3_0 :: Nat → nil:cons

(9) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
rev, rev1, rev2

They will be analysed ascendingly in the following order:
rev1 < rev
rev = rev2

(10) Obligation:

TRS:
Rules:
rev(nil) → nil
rev(cons(x, l)) → cons(rev1(x, l), rev2(x, l))
rev1(0', nil) → 0'
rev1(s, nil) → s
rev1(x, cons(y, l)) → rev1(y, l)
rev2(x, nil) → nil
rev2(x, cons(y, l)) → rev(cons(x, rev2(y, l)))

Types:
rev :: nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
rev1 :: 0':s → nil:cons → 0':s
rev2 :: 0':s → nil:cons → nil:cons
0' :: 0':s
s :: 0':s
hole_nil:cons1_0 :: nil:cons
hole_0':s2_0 :: 0':s
gen_nil:cons3_0 :: Nat → nil:cons

Generator Equations:
gen_nil:cons3_0(0) ⇔ nil
gen_nil:cons3_0(+(x, 1)) ⇔ cons(0', gen_nil:cons3_0(x))

The following defined symbols remain to be analysed:
rev1, rev, rev2

They will be analysed ascendingly in the following order:
rev1 < rev
rev = rev2

(11) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
rev1(0', gen_nil:cons3_0(n5_0)) → 0', rt ∈ Ω(1 + n5₀)

Induction Base:
rev1(0', gen_nil:cons3_0(0)) →_R^Ω(1)
0'

Induction Step:
rev1(0', gen_nil:cons3_0(+(n5_0, 1))) →_R^Ω(1)
rev1(0', gen_nil:cons3_0(n5_0)) →_IH
0'

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(12) Complex Obligation (BEST)

(13) Obligation:

TRS:
Rules:
rev(nil) → nil
rev(cons(x, l)) → cons(rev1(x, l), rev2(x, l))
rev1(0', nil) → 0'
rev1(s, nil) → s
rev1(x, cons(y, l)) → rev1(y, l)
rev2(x, nil) → nil
rev2(x, cons(y, l)) → rev(cons(x, rev2(y, l)))

Types:
rev :: nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
rev1 :: 0':s → nil:cons → 0':s
rev2 :: 0':s → nil:cons → nil:cons
0' :: 0':s
s :: 0':s
hole_nil:cons1_0 :: nil:cons
hole_0':s2_0 :: 0':s
gen_nil:cons3_0 :: Nat → nil:cons

Lemmas:
rev1(0', gen_nil:cons3_0(n5_0)) → 0', rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_nil:cons3_0(0) ⇔ nil
gen_nil:cons3_0(+(x, 1)) ⇔ cons(0', gen_nil:cons3_0(x))

The following defined symbols remain to be analysed:
rev2, rev

They will be analysed ascendingly in the following order:
rev = rev2

(14) RewriteLemmaProof (EQUIVALENT transformation)

Proved the following rewrite lemma:
rev2(0', gen_nil:cons3_0(n203_0)) → gen_nil:cons3_0(n203_0), rt ∈ Ω(2ⁿ)

Induction Base:
rev2(0', gen_nil:cons3_0(0)) →_R^Ω(1)
nil

Induction Step:
rev2(0', gen_nil:cons3_0(+(n203_0, 1))) →_R^Ω(1)
rev(cons(0', rev2(0', gen_nil:cons3_0(n203_0)))) →_IH
rev(cons(0', gen_nil:cons3_0(c204_0))) →_R^Ω(1)
cons(rev1(0', gen_nil:cons3_0(n203_0)), rev2(0', gen_nil:cons3_0(n203_0))) →_L^{Ω(1 + n203₀)}
cons(0', rev2(0', gen_nil:cons3_0(n203_0))) →_IH
cons(0', gen_nil:cons3_0(c204_0))

We have rt ∈ Ω(2ⁿ) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(2ⁿ)

(15) BOUNDS(2^n, INF)

(16) Obligation:

TRS:
Rules:
rev(nil) → nil
rev(cons(x, l)) → cons(rev1(x, l), rev2(x, l))
rev1(0', nil) → 0'
rev1(s, nil) → s
rev1(x, cons(y, l)) → rev1(y, l)
rev2(x, nil) → nil
rev2(x, cons(y, l)) → rev(cons(x, rev2(y, l)))

Types:
rev :: nil:cons → nil:cons
nil :: nil:cons
cons :: 0':s → nil:cons → nil:cons
rev1 :: 0':s → nil:cons → 0':s
rev2 :: 0':s → nil:cons → nil:cons
0' :: 0':s
s :: 0':s
hole_nil:cons1_0 :: nil:cons
hole_0':s2_0 :: 0':s
gen_nil:cons3_0 :: Nat → nil:cons

Lemmas:
rev1(0', gen_nil:cons3_0(n5_0)) → 0', rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_nil:cons3_0(0) ⇔ nil
gen_nil:cons3_0(+(x, 1)) ⇔ cons(0', gen_nil:cons3_0(x))

No more defined symbols left to analyse.

(17) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
rev1(0', gen_nil:cons3_0(n5_0)) → 0', rt ∈ Ω(1 + n5₀)

(18) BOUNDS(n^1, INF)